Les Automates d’Ordre-Partiel et les Équivalences Comportementales Partial-Order Automata and Behavioural Equivalences

نویسندگان

  • Mônica Lara de Souza
  • Robert de Simone
چکیده

The modelling of concurrent systems by synchronized distributed automata generates a natural independence notion between events of the global system. The theory of Mazurkiewicz traces suggests that such an independence relation induces an equivalence relation over the sequences of events of the system. So-called Partial-Order Automata use independence for the reductions of the interleaved global system. We investigate their use for the verification of behavioural relations such as (finitary) language inclusion or bisimulations. The limits of the approach are shown as well as suggestions for practical applications and some experimental results on classical examples. MOTS-CLÉS : Verification, Bisimulation, Méthodes d’Ordre-Partiel, Réseaux d’Automates, Reduction

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods

It is desirable to integrate formal verification techniques applicable to different languages. We present Exp.Open 2.0, a new tool of the Cadp verification toolbox which combines several features. First, Exp.Open 2.0 allows to describe concurrent systems as a composition of finite state machines, using either synchronization vectors, or parallel composition, hiding, renaming, and cut operators ...

متن کامل

A Geometrical Hierarchy on Graphs via Cellular Automata

Historically, cellular automata were deened on the lattices Z n , but the deenition can be extended to bounded degree graphs. Given a notion of simulation between cellular automata deened on diierent structures (namely graphs of automata), we can deduce an order on graphs. In this paper, we link this order to graph properties and explicit the order for most of the common graphs. R esum e Histor...

متن کامل

Brain Magnetic Resonance Image Segmentation Segmentation d’images IRM cérébrales

This paper presents two segmentation methods, based on Markov Random Fields (MRF), to quantify automatically brain tissue volumes from Magnetic Resonance (MR) images. Anatomically, a human brain is considered as composed of three main tissues: gray matter, white matter and cerebrospinal fluid (CSF). Due to the resolution limitation of the image acquisition system, a voxel in MR image may be com...

متن کامل

Rainbow supercharacters and a poset analogue to q-binomial coefficients

This paper introduces a variation on the binomial coefficient that depends on a poset and interpolates between q-binomials and 1-binomials: a total order gives the usual q-binomial, and a poset with no relations gives the usual binomial coefficient. These coefficients arise naturally in the study of supercharacters of the finite groups of unipotent upper-triangular matrices, whose representatio...

متن کامل

Tensor approach to mixed high-order moments of absorbing Markov chains

Moments of absorbing Markov chain are considered. First moments and non-mixed second moments are determined in classical textbooks such as the book of J. Kemeny and J. Snell “Finite Markov Chains”. The reason is that the first moments and the non-mixed second moments can be easily expressed in a matrix form. Since the representation of mixed moments of higher orders in a matrix form is not stra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007